<!DOCTYPE html><html lang="zh-CN" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width,initial-scale=1"><title>NOIP 2018 退役记 | Von Brank</title><meta name="keywords" content="日常"><meta name="author" content="Von Brank"><meta name="copyright" content="Von Brank"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta name="description" content="NOIP 2018 退役记">
<meta property="og:type" content="article">
<meta property="og:title" content="NOIP 2018 退役记">
<meta property="og:url" content="https://vonbrank.github.io/archives/noip-2018-afo-experience/index.html">
<meta property="og:site_name" content="Von Brank">
<meta property="og:description" content="NOIP 2018 退役记">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="https://s3.ax1x.com/2021/02/28/69wnfS.md.jpg">
<meta property="article:published_time" content="2018-11-13T04:10:19.000Z">
<meta property="article:modified_time" content="2022-05-17T05:59:38.868Z">
<meta property="article:author" content="Von Brank">
<meta property="article:tag" content="日常">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="https://s3.ax1x.com/2021/02/28/69wnfS.md.jpg"><link rel="shortcut icon" href="https://s2.loli.net/2022/01/08/s8FYlS5uPrtichT.jpg"><link rel="canonical" href="https://vonbrank.github.io/archives/noip-2018-afo-experience/"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css" media="print" onload="this.media='all'"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/node-snackbar/dist/snackbar.min.css" media="print" onload="this.media='all'"><script>const GLOBAL_CONFIG = { 
  root: '/',
  algolia: undefined,
  localSearch: {"path":"search.xml","languages":{"hits_empty":"找不到您查询的内容：${query}"}},
  translate: {"defaultEncoding":2,"translateDelay":0,"msgToTraditionalChinese":"繁","msgToSimplifiedChinese":"简"},
  noticeOutdate: undefined,
  highlight: {"plugin":"highlighjs","highlightCopy":true,"highlightLang":true,"highlightHeightLimit":false},
  copy: {
    success: '复制成功',
    error: '复制错误',
    noSupport: '浏览器不支持'
  },
  relativeDate: {
    homepage: false,
    post: false
  },
  runtime: '天',
  date_suffix: {
    just: '刚刚',
    min: '分钟前',
    hour: '小时前',
    day: '天前',
    month: '个月前'
  },
  copyright: undefined,
  lightbox: 'fancybox',
  Snackbar: {"chs_to_cht":"你已切换为繁体","cht_to_chs":"你已切换为简体","day_to_night":"你已切换为深色模式","night_to_day":"你已切换为浅色模式","bgLight":"#49b1f5","bgDark":"#121212","position":"bottom-left"},
  source: {
    jQuery: 'https://cdn.jsdelivr.net/npm/jquery@latest/dist/jquery.min.js',
    justifiedGallery: {
      js: 'https://cdn.jsdelivr.net/npm/justifiedGallery/dist/js/jquery.justifiedGallery.min.js',
      css: 'https://cdn.jsdelivr.net/npm/justifiedGallery/dist/css/justifiedGallery.min.css'
    },
    fancybox: {
      js: 'https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.js',
      css: 'https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.css'
    }
  },
  isPhotoFigcaption: false,
  islazyload: true,
  isanchor: false
}</script><script id="config-diff">var GLOBAL_CONFIG_SITE = {
  title: 'NOIP 2018 退役记',
  isPost: true,
  isHome: false,
  isHighlightShrink: false,
  isToc: true,
  postUpdate: '2022-05-17 13:59:38'
}</script><noscript><style type="text/css">
  #nav {
    opacity: 1
  }
  .justified-gallery img {
    opacity: 1
  }

  #recent-posts time,
  #post-meta time {
    display: inline !important
  }
</style></noscript><script>(win=>{
    win.saveToLocal = {
      set: function setWithExpiry(key, value, ttl) {
        if (ttl === 0) return
        const now = new Date()
        const expiryDay = ttl * 86400000
        const item = {
          value: value,
          expiry: now.getTime() + expiryDay,
        }
        localStorage.setItem(key, JSON.stringify(item))
      },

      get: function getWithExpiry(key) {
        const itemStr = localStorage.getItem(key)

        if (!itemStr) {
          return undefined
        }
        const item = JSON.parse(itemStr)
        const now = new Date()

        if (now.getTime() > item.expiry) {
          localStorage.removeItem(key)
          return undefined
        }
        return item.value
      }
    }
  
    win.getScript = url => new Promise((resolve, reject) => {
      const script = document.createElement('script')
      script.src = url
      script.async = true
      script.onerror = reject
      script.onload = script.onreadystatechange = function() {
        const loadState = this.readyState
        if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
        script.onload = script.onreadystatechange = null
        resolve()
      }
      document.head.appendChild(script)
    })
  
      win.activateDarkMode = function () {
        document.documentElement.setAttribute('data-theme', 'dark')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#0d0d0d')
        }
      }
      win.activateLightMode = function () {
        document.documentElement.setAttribute('data-theme', 'light')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#ffffff')
        }
      }
      const t = saveToLocal.get('theme')
    
          const now = new Date()
          const hour = now.getHours()
          const isNight = hour <= 6 || hour >= 18
          if (t === undefined) isNight ? activateDarkMode() : activateLightMode()
          else if (t === 'light') activateLightMode()
          else activateDarkMode()
        
      const asideStatus = saveToLocal.get('aside-status')
      if (asideStatus !== undefined) {
        if (asideStatus === 'hide') {
          document.documentElement.classList.add('hide-aside')
        } else {
          document.documentElement.classList.remove('hide-aside')
        }
      }
    
    const detectApple = () => {
      if (GLOBAL_CONFIG_SITE.isHome && /iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)){
        document.documentElement.classList.add('apple')
      }
    }
    detectApple()
    })(window)</script><meta name="generator" content="Hexo 5.4.0"><link rel="alternate" href="/atom.xml" title="Von Brank" type="application/atom+xml">
</head><body><div id="loading-box"><div class="loading-left-bg"></div><div class="loading-right-bg"></div><div class="spinner-box"><div class="configure-border-1"><div class="configure-core"></div></div><div class="configure-border-2"><div class="configure-core"></div></div><div class="loading-word">加载中...</div></div></div><div id="web_bg"></div><div id="sidebar"><div id="menu-mask"></div><div id="sidebar-menus"><div class="avatar-img is-center"><img src= "" data-lazy-src="https://s2.loli.net/2022/01/08/s8FYlS5uPrtichT.jpg" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"/></div><div class="site-data"><div class="data-item is-center"><div class="data-item-link"><a href="/archives/"><div class="headline">文章</div><div class="length-num">46</div></a></div></div><div class="data-item is-center"><div class="data-item-link"><a href="/tags/"><div class="headline">标签</div><div class="length-num">25</div></a></div></div><div class="data-item is-center"><div class="data-item-link"><a href="/categories/"><div class="headline">分类</div><div class="length-num">19</div></a></div></div></div><hr/><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 归档</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page" href="/comments/"><i class="fa-fw fas fa-comments"></i><span> 评论</span></a></div><div class="menus_item"><a class="site-page" href="javascript:void(0);"><i class="fa-fw fas fa-tools"></i><span> 工具</span><i class="fas fa-chevron-down expand"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="https://vonbrank.github.io/hit-introduction-to-discrete-mathematics/"><i class="fa-fw fas fa-less-than-equal"></i><span> 《离散数学引论》答案补充</span></a></li><li><a class="site-page child" href="https://vonbrank.github.io/my-tech-companies-website/"><i class="fa-fw fas fa-server"></i><span> 科技公司网页模仿</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 友链</span></a></div></div></div></div><div class="post" id="body-wrap"><header class="post-bg" id="page-header" style="background-image: url('https://s3.ax1x.com/2021/02/28/69wnfS.md.jpg')"><nav id="nav"><span id="blog_name"><a id="site-name" href="/">Von Brank</a></span><div id="menus"><div id="search-button"><a class="site-page social-icon search"><i class="fas fa-search fa-fw"></i><span> 搜索</span></a></div><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 归档</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page" href="/comments/"><i class="fa-fw fas fa-comments"></i><span> 评论</span></a></div><div class="menus_item"><a class="site-page" href="javascript:void(0);"><i class="fa-fw fas fa-tools"></i><span> 工具</span><i class="fas fa-chevron-down expand"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="https://vonbrank.github.io/hit-introduction-to-discrete-mathematics/"><i class="fa-fw fas fa-less-than-equal"></i><span> 《离散数学引论》答案补充</span></a></li><li><a class="site-page child" href="https://vonbrank.github.io/my-tech-companies-website/"><i class="fa-fw fas fa-server"></i><span> 科技公司网页模仿</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 友链</span></a></div></div><div id="toggle-menu"><a class="site-page"><i class="fas fa-bars fa-fw"></i></a></div></div></nav><div id="post-info"><h1 class="post-title">NOIP 2018 退役记</h1><div id="post-meta"><div class="meta-firstline"><span class="post-meta-date"><i class="far fa-calendar-alt fa-fw post-meta-icon"></i><span class="post-meta-label">发表于</span><time class="post-meta-date-created" datetime="2018-11-13T04:10:19.000Z" title="发表于 2018-11-13 12:10:19">2018-11-13</time><span class="post-meta-separator">|</span><i class="fas fa-history fa-fw post-meta-icon"></i><span class="post-meta-label">更新于</span><time class="post-meta-date-updated" datetime="2022-05-17T05:59:38.868Z" title="更新于 2022-05-17 13:59:38">2022-05-17</time></span><span class="post-meta-categories"><span class="post-meta-separator">|</span><i class="fas fa-inbox fa-fw post-meta-icon"></i><a class="post-meta-categories" href="/categories/%E6%97%A5%E5%B8%B8/">日常</a></span></div><div class="meta-secondline"><span class="post-meta-separator">|</span><span class="post-meta-wordcount"><i class="far fa-file-word fa-fw post-meta-icon"></i><span class="post-meta-label">字数总计:</span><span class="word-count">3.8k</span><span class="post-meta-separator">|</span><i class="far fa-clock fa-fw post-meta-icon"></i><span class="post-meta-label">阅读时长:</span><span>12分钟</span></span><span class="post-meta-separator">|</span><span class="post-meta-pv-cv" id="" data-flag-title="NOIP 2018 退役记"><i class="far fa-eye fa-fw post-meta-icon"></i><span class="post-meta-label">阅读量:</span><span id="busuanzi_value_page_pv"></span></span></div></div></div></header><main class="layout" id="content-inner"><div id="post"><article class="post-content" id="article-container"><p>本文迁移自洛谷，原文链接：<a target="_blank" rel="noopener" href="https://von-brank.blog.luogu.org/Noip-2018-final-blog">https://von-brank.blog.luogu.org/Noip-2018-final-blog</a></p>
<h2 id="NOIP-2018-试题列表：">NOIP 2018 试题列表：</h2>
<ul>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P5019">D1T1 铺设道路</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P5020">D1T2 货币系统</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P5021">D1T3 赛道修建</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P5022">D2T1 旅行</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P5023">D2T2 填数游戏</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P5024">D2T3 保卫王国</a></p>
</li>
</ul>
<hr>
<p><s>一年OI一场空…</s></p>
<p>这是我第一次参加NOIP，也是最后一次参加NOIP了</p>
<p>在退役之前写一篇文章纪念一下</p>
<hr>
<h1>2017.07 - 2017.10</h1>
<p>中考完后的暑假，不是在家和朋友语音开黑聊天打游戏，就是出门浪~~(颓废)~~。闲来无事，突然心血来潮想要学习C语言，在B站找到了<a target="_blank" rel="noopener" href="https://www.bilibili.com/video/BV1sJ411E7St">翁恺的C语言慕课</a>开始学敲代码(130多集的微课我居然三个月就看完了)，我的OI生涯从这里开始.</p>
<hr>
<h1>2017.11 - 2018.11</h1>
<h2 id="正式OI生涯">正式OI生涯</h2>
<h3 id="2017-11-04">2017.11.04</h3>
<p>加入Luogu</p>
<h3 id="2017-11-05">2017.11.05</h3>
<p>成为了小小牛</p>
<h3 id="2017-11-08">2017.11.08</h3>
<p>成为了小小犇</p>
<h3 id="2017-11-22">2017.11.22</h3>
<p>成为了小牛</p>
<h3 id="2017-12-24">2017.12.24</h3>
<p>成为了小犇</p>
<h3 id="2018-01-13">2018.01.13</h3>
<p>成为了中牛</p>
<h3 id="2018-02-05">2018.02.05</h3>
<p>成为了中犇</p>
<h3 id="2018-02-25">2018.02.25</h3>
<p>成为了大牛</p>
<h3 id="2018-03-15">2018.03.15</h3>
<p>AC<a target="_blank" rel="noopener" href="https://www.luogu.org/record/show?rid=6222115">树链剖分模板</a>——我人生中AC的第一道紫题啊！！！</p>
<h3 id="2018-03-28">2018.03.28</h3>
<p>第一次独立AC蓝题</p>
<h3 id="2018-03-30">2018.03.30</h3>
<p>成为了大犇</p>
<h3 id="2018-05-04">2018.05.04</h3>
<p>AC 100题(大概有90%是黄题及以下吧Orz)</p>
<h3 id="2018-05-12">2018.05.12</h3>
<p>成为了神牛</p>
<h3 id="2018-06-23">2018.06.23</h3>
<p>AC 200题</p>
<h3 id="2018-08-02"><s>2018.08.02</s></h3>
<p><s>成为了神犇(fAKe)</s></p>
<h3 id="2018-10-11">2018.10.11</h3>
<p>AC 300题</p>
<h2 id="特别感谢Yukko-尽管如今他已经退役了">特别感谢<a target="_blank" rel="noopener" href="https://yukkohzq.github.io/">Yukko</a>(尽管如今他已经退役了):</h2>
<p>初中三年每年都看着他参加NOIP，以前闲聊时他也常常给我普及一些算法知识(尽管当时的我不怎么听得懂)。在我入坑OI后他不仅经常手把手教我调试Luogu新手村的水题(在当时的我看来都是神题)，还在第一时间教会了我怎么写dfs、bfs、求最长上升子序列 LIS，以及用 Floyd/Dijkstra/SPFA 求单源最短路，这在当时(2017.12)算是领先了与我同时期入坑OI的大多数人(尽管现在我已经远远落后于各路神犇)，为我之后学习各种算法奠定了坚实基础。</p>
<hr>
<h1>Day-1 &amp; Day0</h1>
<h2 id="2018-11-08-2018-11-09">2018.11.08 - 2018.11.09</h2>
<p>考前两天已经不怎么写新题了，就打了几个模板，再从<a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P1000">P1000 超级玛丽游戏</a>开始看看这一年写过的题. 学机房dalao打了一颗<a target="_blank" rel="noopener" href="https://www.luogu.org/paste/evgtymjh">完美线段树</a>，不知道考场上用不用得上.</p>
<hr>
<h1>Day1</h1>
<h2 id="2018-11-10">2018.11.10</h2>
<p>毕竟我是第一次考NOIP，虽然模拟赛已经打了不少了，但是真正上考场还是比较虚的，并没有十足的把握拿省一.</p>
<h2 id="8-30">8:30</h2>
<p>拿到题目之后看的第一眼，三道题名暗示了图论?(road), 数论?(money)，数据结构神题?(track)，不过看了一眼内存空间限制512MB，感觉应该比某些毒瘤卡空间模拟赛轻松一些.</p>
<h2 id="8-32">8:32</h2>
<p>看完T1题面的第一反应：woc，这不是<a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P1969">NOIP 2013 D1T1 积木大赛</a>？我没有读错题吧，是不是有坑？然而5分钟敲完的积木大赛的代码，小样例大样例都能直接过掉，应该没什么问题. 100pts到手了.</p>
<p>炒冷饭，就服CCF，hhh…</p>
<h2 id="8-40">8:40</h2>
<p>读懂T2题面后的感觉是：这难道是小凯的疑惑毒瘤增强版？那遇到纯数论题就只能打暴力的我岂不是凉了？再看一眼数据范围 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi><mo>≤</mo><mn>100</mn></mrow><annotation encoding="application/x-tex">n \leq 100</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719400000000001em;vertical-align:-0.13597em;"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">1</span><span class="mord">0</span><span class="mord">0</span></span></span></span>, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>a</mi><mi>i</mi></msub><mo>≤</mo><mn>25000</mn></mrow><annotation encoding="application/x-tex">a_i \leq 25000</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7859700000000001em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal">a</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.31166399999999994em;"><span style="top:-2.5500000000000003em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">2</span><span class="mord">5</span><span class="mord">0</span><span class="mord">0</span><span class="mord">0</span></span></span></span>，没达到<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>1</mn><msup><mn>0</mn><mn>18</mn></msup></mrow><annotation encoding="application/x-tex">10^{18}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8141079999999999em;vertical-align:0em;"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141079999999999em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">1</span><span class="mord mtight">8</span></span></span></span></span></span></span></span></span></span></span></span>那么吓人，感觉暴力或者乱搞还是勉强能拿部分分的.</p>
<p>在草稿纸上乱搞了10分钟后发现答案应该是给出的那一堆货币面额的子集，否则会不符合题意，那么似乎可以<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><msup><mi>n</mi><mn>3</mn></msup><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(n^3)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.064108em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal">n</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141079999999999em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">3</span></span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>枚举每三个数，看看较小的那两个数能不能凑出较大的那个数，如果可以就去掉.</p>
<p>诶？这是不是小凯的疑惑？又花了十几分钟打出一个 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>T</mi><mo>∗</mo><msup><mi>n</mi><mn>3</mn></msup><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(T * n ^ 3)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.13889em;">T</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">∗</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:1.064108em;vertical-align:-0.25em;"></span><span class="mord"><span class="mord mathnormal">n</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141079999999999em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">3</span></span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span> 的做法，过了样例1，但是样例2没过——第七组和第九组数据WA了，输出居然比答案多1. 赶紧debug看看是哪一个数字没有被fuck掉，发现一个数如果能被另外三个或以上的数乘上系数凑出来也是可以合法被去掉的——woc这真是小凯的疑惑毒瘤增强版.</p>
<p>冷静一下，我开始认真思考这题要怎么搞，想起有道dp题叫<a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P2347">砝码称重</a>，把数从小到大排序，赋初值<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>a</mi><mi>n</mi><mi>s</mi><mo>=</mo><mi>n</mi></mrow><annotation encoding="application/x-tex">ans=n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">a</span><span class="mord mathnormal">n</span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">n</span></span></span></span>，开个<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mi>o</mi><mi>o</mi><mi>l</mi></mrow><annotation encoding="application/x-tex">bool</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.69444em;vertical-align:0em;"></span><span class="mord mathnormal">b</span><span class="mord mathnormal">o</span><span class="mord mathnormal">o</span><span class="mord mathnormal" style="margin-right:0.01968em;">l</span></span></span></span>数组记录一下每个数可不可以被前面的数凑出来，如果可以(被标记过)就令<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>a</mi><mi>n</mi><mi>s</mi><mo>−</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">ans-1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.66666em;vertical-align:-0.08333em;"></span><span class="mord mathnormal">a</span><span class="mord mathnormal">n</span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">1</span></span></span></span>，否则遍历该<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mi>o</mi><mi>o</mi><mi>l</mi></mrow><annotation encoding="application/x-tex">bool</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.69444em;vertical-align:0em;"></span><span class="mord mathnormal">b</span><span class="mord mathnormal">o</span><span class="mord mathnormal">o</span><span class="mord mathnormal" style="margin-right:0.01968em;">l</span></span></span></span>数组并把&quot;这个数的倍数+已标记的<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mi>o</mi><mi>o</mi><mi>l</mi></mrow><annotation encoding="application/x-tex">bool</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.69444em;vertical-align:0em;"></span><span class="mord mathnormal">b</span><span class="mord mathnormal">o</span><span class="mord mathnormal">o</span><span class="mord mathnormal" style="margin-right:0.01968em;">l</span></span></span></span>数组下标&quot;标记上。把这个做法敲出来，调一调就过样例2了，期望如果数据友好一些就可以AC了. YES!!!</p>
<h2 id="10-35">10:35</h2>
<p>写T2之前就瞥了一眼T3，感觉题目太长就没细看，觉得T3敲个暴力就差不多了，毕竟T3通常不可做.</p>
<p>现在仔细读题：要求最小值最大？明显要二分. 再看第一档部分分：<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi><mo>=</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">m=1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">m</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">1</span></span></span></span>？也就是说求个树的直径就可以拿20. 赶紧敲了个<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>D</mi><mi>i</mi><mi>j</mi><mi>k</mi><mi>s</mi><mi>t</mi><mi>r</mi><mi>a</mi></mrow><annotation encoding="application/x-tex">Dijkstra</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8888799999999999em;vertical-align:-0.19444em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">D</span><span class="mord mathnormal">i</span><span class="mord mathnormal" style="margin-right:0.05724em;">j</span><span class="mord mathnormal" style="margin-right:0.03148em;">k</span><span class="mord mathnormal">s</span><span class="mord mathnormal">t</span><span class="mord mathnormal" style="margin-right:0.02778em;">r</span><span class="mord mathnormal">a</span></span></span></span>+<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>H</mi><mi>e</mi><mi>a</mi><mi>p</mi></mrow><annotation encoding="application/x-tex">Heap</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8777699999999999em;vertical-align:-0.19444em;"></span><span class="mord mathnormal" style="margin-right:0.08125em;">H</span><span class="mord mathnormal">e</span><span class="mord mathnormal">a</span><span class="mord mathnormal">p</span></span></span></span>优化的最短路（因为写的比较熟）.</p>
<p>再看看剩下的部分分，菊花图和一条链的数据好像可做，菊花图搞个 二分+排序+贪心 应该就可以了， 一条链也是 二分+贪心， 又搞了40分钟，生成了几组小数据拍过了，感觉可以拿55了，剩下的分看起来是树形dp，但是懒得想了（主要是我太菜了想不出来，而且也没时间了），所以写到这里就差不多可以交了.</p>
<h2 id="12-00">12:00</h2>
<p>检查完文件名和输入输出就交了. DAY1 考场部分到此结束，刚出考场时期望得分还是有255的.</p>
<h2 id="15-30">15:30</h2>
<p>一觉醒来准备想去机房颓废，突然想起：早上T2如果造出前99个质数+一个25000的数据那我岂不是TLE飞去？因为这时候复杂度最坏可以达到<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>T</mi><mo>∗</mo><mi>n</mi><mo>∗</mo><mo stretchy="false">(</mo><mrow><mi>m</mi><mi>a</mi><mi>x</mi><mo stretchy="false">{</mo><msub><mi>a</mi><mi>i</mi></msub><mo stretchy="false">}</mo></mrow><msup><mo stretchy="false">)</mo><mn>2</mn></msup><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(T * n * ({max\{a_i\}})^2)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.13889em;">T</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">∗</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:0.46528em;vertical-align:0em;"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">∗</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:1.064108em;vertical-align:-0.25em;"></span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal">m</span><span class="mord mathnormal">a</span><span class="mord mathnormal">x</span><span class="mopen">{</span><span class="mord"><span class="mord mathnormal">a</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.31166399999999994em;"><span style="top:-2.5500000000000003em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mclose">}</span></span><span class="mclose"><span class="mclose">)</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141079999999999em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>. 这么算来T2只有75分是稳的了，希望数据友好一些吧…</p>
<p>还有T3，突然想起来我二分答案的范围好像设错了，原题中是 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>l</mi><mi>i</mi></msub><mo>≤</mo><mn>10000</mn></mrow><annotation encoding="application/x-tex">l_i \leq 10000</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.84444em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.01968em;">l</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.31166399999999994em;"><span style="top:-2.5500000000000003em;margin-left:-0.01968em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">1</span><span class="mord">0</span><span class="mord">0</span><span class="mord">0</span><span class="mord">0</span></span></span></span> 来着，而我为了调样例方便把上界设为 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mo>=</mo><mn>30000</mn></mrow><annotation encoding="application/x-tex">r=30000</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">r</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">3</span><span class="mord">0</span><span class="mord">0</span><span class="mord">0</span><span class="mord">0</span></span></span></span> ，提交前忘记改回来了，并且在一条链的数据中忘记将边的长度序列从小到大排序，如果数据中<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">m</span></span></span></span>比较小或者输入的树边不是按顺序的那就gg了. 菊花图和链的30分又没了，唉… D1期望得分掉回225-了.</p>
<hr>
<h1>Day2</h1>
<h2 id="2018-11-11">2018.11.11</h2>
<p>由于D1T1出了NOIP2013原题，导致Day1整体偏简单(大概全机房除了我，都AK了吧).所以早有传闻Day2的题会爆难(同机房dalao多次警告：可能会有传说中毁天灭地的第七分块，建议直接打暴力…Orz).</p>
<h2 id="8-30-2">8:30</h2>
<p>由于早就听说Day2的题不太可做，于是开考后我先干点别的，比如先验证一下昨天机房dalao所说的今年CCF评测机换成 Intel® Core™ i7-8700K Processor + 32GB RAM 了，一看注意事项还真是如此，Day1考试的时候没注意这一点，没想到第一次参加NOIP就碰上CCF老爷机换成CCF队爷机了，这就意味着代码常数大一点也没事，但是不知道是用什么主板，而且Noi Linux万年32位的系统又怎么寻址得了32GB？<s>不过如果CPU上个液态氮，超频到8.0GHz，那么写个暴力大搜索也是能过的吧</s>.</p>
<h2 id="8-33">8:33</h2>
<p>颓废结束. 先把3题都看了一眼，感觉T2 T3题目又臭又长又不可做呢.</p>
<h2 id="8-35">8:35</h2>
<p>跳回来认真看T1.依照题意，要求一张图的字典序最小的dfs续，看起来直接从1号节点开始贪心dfs可做，不过第一眼看错题目了，以为是一张普通无向图，想了5分钟想不出一些边界条件的处理方法，然后才发现有 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi><mo>≤</mo><mi>n</mi></mrow><annotation encoding="application/x-tex">m \leq n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719400000000001em;vertical-align:-0.13597em;"></span><span class="mord mathnormal">m</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">n</span></span></span></span> 这个条件.</p>
<p>那么前60分<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi><mo>=</mo><mi>n</mi><mo>−</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">m = n - 1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">m</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.66666em;vertical-align:-0.08333em;"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">1</span></span></span></span>的数据就稳了，几分钟写个dfs，然后先用邻接矩阵村边，再从大到小遍历邻接矩阵，改成链式前向星存边，这样就可以保证严格按照最小字典序进行dfs遍历，而且是跑得超快的 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(2n-1)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord">2</span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord">1</span><span class="mclose">)</span></span></span></span> 时间复杂度的dfs.</p>
<p>重点是后40分 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi><mo>=</mo><mi>m</mi></mrow><annotation encoding="application/x-tex">n = m</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.43056em;vertical-align:0em;"></span><span class="mord mathnormal">m</span></span></span></span> 的情况，咋一看直接照着前60分的方法dfs一次，遇到走过的点就退出就可以了，结果样例都过不了. 然后开始想各种奇怪的dfs方法，什么“记录每个节点的次小子节点并与当前节点比较来决定是否回溯”、“记录每个节点前驱最小子节点并与当前节点编号比较来决定是否回溯”、“动态判断子节点能否被再次搜索到来决定是否回溯”之类的玄学方法，但是都过不了样例. 此时已经9:15了，如果再写不出T1，Day2就凉了…</p>
<p>突然想起来我们不是要处理环嘛，若要很方便地处理环套树，那自然是用Tarjan求双联通分量，然后只要记录一下首次搜索到环的入口节点的次小环上子节点，一旦搜索到编号比该节点大的环上节点就立即回溯，这样应该就是最优解了. 花10分钟写了个Tarjan，结果写挂了，调了20分钟才救回来. 测一下样例，诶？居然大小样例都能过，那这题就AC了？(事实上这样做是错的，Day2当天晚上同机房大佬<a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=96312">srydsf123</a>在听了我的解法后瞬间出了一组数据Hack掉了这种做法，这说明大样例还是挺水的).</p>
<h2 id="10-00">10:00</h2>
<p>T1已经困了我一个半小时了，T2 T3打打暴力应该就差不多了，毕竟Day2对于我这种蒟蒻来说有个100+就不错了.</p>
<p>看见T2，读了差不多10分钟才知道题目想干嘛. 感觉要做出来得打表找规律，那就先打暴力. 但是这个暴力还是不太好打的，得先枚举出所有路径，再枚举01矩阵并检验是否合法. 打了20分钟的暴力，测测样例1：Yes!!! 过了；测测样例2：woc!!! 输出96？什么鬼，我暴力写挂了？然而20分钟肉眼调试并没有查出错误… (为什么CCF不把样例2解释一下啊，112种可能结果很难一一列举出来么#滑稽). 没辙，已经快11:00了，万一T3暴力又写挂今天就真的凉了，于是T2我放上写挂的搜索+输出所有样例就走了. 至于这题有没有样例分就只能拼rp了.</p>
<h2 id="10-55">10:55</h2>
<p>T3题意蛮容易读的，可能正因为这样，我竟然读错题了，我以为这题就是<a target="_blank" rel="noopener" href="https://www.luogu.org/problemnew/show/P2458">保安站岗</a>. 先10分钟打出 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>m</mi><mo>∗</mo><msup><mn>2</mn><mi>n</mi></msup><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(m * 2^n)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord mathnormal">m</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">∗</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord"><span class="mord">2</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.664392em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">n</span></span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span> 的大暴力，测一测小样例，可以过。然后因为不太记得保安站岗的详细做法，所以决定先不写保安站岗的树形dp了，转而去写一条链的部分分. 又是20分钟过去了.</p>
<p>已经11:30了， 因为没有一条链的样例，所以这个做法对不对只能听天由命了. 然后突然发现样例2的数据规模挺小的 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi><mo separator="true">,</mo><mi>m</mi><mo>≤</mo><mn>10</mn></mrow><annotation encoding="application/x-tex">n,m \leq 10</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8304100000000001em;vertical-align:-0.19444em;"></span><span class="mord mathnormal">n</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.16666666666666666em;"></span><span class="mord mathnormal">m</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2777777777777778em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">1</span><span class="mord">0</span></span></span></span>， 就拿来测一下 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>m</mi><mo>∗</mo><msup><mn>2</mn><mi>n</mi></msup><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(m * 2^n)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord mathnormal">m</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">∗</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord"><span class="mord">2</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.664392em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">n</span></span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span> 的大暴力——竟然WA了？还剩半个小时突然发现T3面临爆零…赶紧肉眼静态查错(在我这种蒟蒻眼中debug暴力程序的方法就只有这种了吧). 一查又是20分钟，找不出任何bug，样例2死活过不去，但只能这样了.</p>
<h2 id="11-50">11:50</h2>
<p>检查文件输入输出就准备交了吧，T1算法的正确性仍有待验证，T2 T3很可能爆零，Day2估计是凉了.</p>
<h2 id="12-00-2">12:00</h2>
<p>刚出考场就突然想到，woc T1直接<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><msup><mi>n</mi><mn>2</mn></msup><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(n^2)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.064108em;vertical-align:-0.25em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal">n</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141079999999999em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>枚举删掉哪一条边然后再dfs不就可以了？我在考场上居然没想出来…</p>
<h2 id="21-20">21:20</h2>
<p>机房大佬<a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=96312">srydsf123</a>Hack掉了我T1的后40分做法，至此，Day2期望得分只有60-80分了</p>
<hr>
<h1>总结</h1>
<p>期望最高得分(<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>D</mi><mi>a</mi><mi>y</mi></mrow><annotation encoding="application/x-tex">Day</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8777699999999999em;vertical-align:-0.19444em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">D</span><span class="mord mathnormal">a</span><span class="mord mathnormal" style="margin-right:0.03588em;">y</span></span></span></span> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>D</mi><mi>r</mi><mi>e</mi><mi>a</mi><mi>m</mi></mrow><annotation encoding="application/x-tex">Dream</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.68333em;vertical-align:0em;"></span><span class="mord mathnormal" style="margin-right:0.02778em;">D</span><span class="mord mathnormal" style="margin-right:0.02778em;">r</span><span class="mord mathnormal">e</span><span class="mord mathnormal">a</span><span class="mord mathnormal">m</span></span></span></span> -  Orz):</p>
<p>100 + 100 + 55 + 100 + 5 + 0 = 360</p>
<p>期望最低得分：</p>
<p>100 + 80 + 20 + 60 + 0 + 0 = 260</p>
<p>用<a target="_blank" rel="noopener" href="https://www.luogu.org/contestnew/show/12952">Luogu</a>提供的数据测试得分:</p>
<p>100 + 95 + 55 + 72 + 5 + 0 = 327</p>
<p>用机房大佬<a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=117525">Dystractor</a>提供的数据测试得分:</p>
<p>100 + 100 + 25 + 76 + 5 + 0 = 306</p>
<p>用友邦提供的数据测试得分(运行结果由<a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=51441">laybxc</a>传达):</p>
<p><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mrow><mo stretchy="false">?</mo><mo stretchy="false">?</mo><mo stretchy="false">?</mo></mrow><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{???}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.89444em;vertical-align:0em;"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span><span class="mclose">?</span><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span></span></span></span> + <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mrow><mo stretchy="false">?</mo><mo stretchy="false">?</mo><mo stretchy="false">?</mo></mrow><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{???}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.89444em;vertical-align:0em;"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span><span class="mclose">?</span><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span></span></span></span> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo fence="false">(</mo><mover accent="true"><mrow><mo stretchy="false">?</mo><mo stretchy="false">?</mo></mrow><mo stretchy="true">‾</mo></mover><mo fence="false">)</mo></mrow><annotation encoding="application/x-tex">\Big( \overline{??} \Big)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.80002em;vertical-align:-0.65002em;"></span><span class="mord"><span class="delimsizing size2">(</span></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span><span class="mord"><span class="delimsizing size2">)</span></span></span></span></span> + <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mrow><mo stretchy="false">?</mo><mo stretchy="false">?</mo></mrow><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{??}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.89444em;vertical-align:0em;"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span></span></span></span> + <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mrow><mo stretchy="false">?</mo><mo stretchy="false">?</mo></mrow><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{??}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.89444em;vertical-align:0em;"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span></span></span></span> + <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mo stretchy="false" lspace="0em" rspace="0em">?</mo><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{?}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.89444em;vertical-align:0em;"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span></span></span></span> + <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mo stretchy="false" lspace="0em" rspace="0em">?</mo><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{?}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.89444em;vertical-align:0em;"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.89444em;"><span style="top:-3em;"><span class="pstrut" style="height:3em;"></span><span class="mord"><span class="mclose">?</span></span></span><span style="top:-3.81444em;"><span class="pstrut" style="height:3em;"></span><span class="overline-line" style="border-bottom-width:0.04em;"></span></span></span></span></span></span></span></span></span> = 309</p>
<p>CCF生成测试数据得分(Reality)：</p>
<p>100 + 100 + 35 + 68 + 10 + 0 = 313</p>
<figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/* </span></span><br><span class="line"><span class="comment">*      ┏┛ ┻━━━━━┛ ┻┓</span></span><br><span class="line"><span class="comment">*      ┃　　　　　　 ┃</span></span><br><span class="line"><span class="comment">*      ┃　　　━　　　┃</span></span><br><span class="line"><span class="comment">*      ┃　┳┛　  ┗┳　┃</span></span><br><span class="line"><span class="comment">*      ┃　　　　　　 ┃</span></span><br><span class="line"><span class="comment">*      ┃　　　┻　　　┃</span></span><br><span class="line"><span class="comment">*      ┃　　　　　　 ┃</span></span><br><span class="line"><span class="comment">*      ┗━┓　　　┏━━━┛</span></span><br><span class="line"><span class="comment">*        ┃　　　┃   神兽保佑</span></span><br><span class="line"><span class="comment">*        ┃　　　┃   代码无BUG！</span></span><br><span class="line"><span class="comment">*        ┃　　　┗━━━━━━━━━┓</span></span><br><span class="line"><span class="comment">*        ┃　　　　　　　    ┣┓</span></span><br><span class="line"><span class="comment">*        ┃　　　　         ┏┛</span></span><br><span class="line"><span class="comment">*        ┗━┓ ┓ ┏━━━┳ ┓ ┏━┛</span></span><br><span class="line"><span class="comment">*          ┃ ┫ ┫   ┃ ┫ ┫</span></span><br><span class="line"><span class="comment">*          ┗━┻━┛   ┗━┻━┛</span></span><br><span class="line"><span class="comment">*/</span> </span><br></pre></td></tr></table></figure>
<p>个人认为今年NOIP画风是真的鬼畜(贪心运气好就AC，运气不好则爆零；猜结论猜对者AC，猜错者爆零)，D1T1出2013年原题实在欠妥，这不仅让GX-TG组的省一分数线提高数十分之多，而且对没写过此题的选手不公平(友邦朋友验证). 另外，这次NOIP竟然没有考数据结构题(不考线段树、树状数组~~、BST、Treap普通平衡树~~之类的就算了，连个栈、队列、链表都不考么，这堆数据结构学了然并卵诶).</p>
<p>NOIP 2018在GX-TG组的省一分数线目前尚不明确(机房大佬们预测省一线在250分左右). 虽然有消息称我的分数是稳省一的，但是由于我在这次比赛中过多使用玄学算法，因此我最终的得分与排名仍有很大的不确定性.</p>
<p>对我个人而言，Day2考的太差，因为看错、写挂而丢了很多分，早知如此就应该死磕D2T1，不打T2 T3了.</p>
<p>有人告诉我说我搞一年OI就可以得省一其实挺值的，但在我看来，这次NOIP终究是有挺多遗憾的…</p>
<hr>
<p>最后在此感谢所有帮助过我或与我共同奋斗过的人:</p>
<ul>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=31470">Uchiha_Obito</a>/<a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=117525">Dystractor</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=52563">GoldenPotato</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=60418">li_z</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://yukkohzq.github.io/">Yukko</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=81494">Ace_Heart</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=13447">Maxwei_wzj</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=83224">114514_hb</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=96312">srydsf123</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=58595">Capacitance_core</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=77262">迅捷之松</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=64314">Summer_Night_Sky</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=81746">Glodfish</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=51441">laybxc</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=82001">zhlgzhh</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=83709">Seass</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=90249">SHDZAYN</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=85126">LSYZX</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=81747">502Chain</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=41950">泅荼</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=43068">nnezhb</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=28416">nnez_xiaoliwei</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=9661">hebomou</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=4025">o0数学迷0o</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=116425">[用户名敏感问题待定]</a> (stO %%% zxbtql %%% --☐-☐-- %%% Orz)</p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=116588">Mireco</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=36701">5743377_2002</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=65899">ComputerEngine</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=73738">Zarathustra</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=86680">dmidcoder</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=81724">AMDYES</a></p>
</li>
<li>
<p><a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=85734">nnezhhh</a></p>
</li>
</ul>
<p>所有值得感谢但因为各种原因未在该列表中出现的人</p>
<p><img src= "" data-lazy-src="https://s1.ax1x.com/2018/11/19/FpUOHS.jpg" alt="XMD_LYJ_AK_IOI"></p>
<p>祝各位NOIP 2018 RP++.</p>
<hr>
<p>By <a target="_blank" rel="noopener" href="https://www.luogu.org/space/show?uid=70367">Von Brank</a></p>
<p>Last Updated at 2018-11-20 08:23:49</p>
</article><div class="post-copyright"><div class="post-copyright__author"><span class="post-copyright-meta">文章作者: </span><span class="post-copyright-info"><a href="mailto:undefined">Von Brank</a></span></div><div class="post-copyright__type"><span class="post-copyright-meta">文章链接: </span><span class="post-copyright-info"><a href="https://vonbrank.github.io/archives/noip-2018-afo-experience/">https://vonbrank.github.io/archives/noip-2018-afo-experience/</a></span></div><div class="post-copyright__notice"><span class="post-copyright-meta">版权声明: </span><span class="post-copyright-info">本博客所有文章除特别声明外，均采用 <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" target="_blank">CC BY-NC-SA 4.0</a> 许可协议。转载请注明来自 <a href="https://vonbrank.github.io" target="_blank">Von Brank</a>！</span></div></div><div class="tag_share"><div class="post-meta__tag-list"><a class="post-meta__tags" href="/tags/%E6%97%A5%E5%B8%B8/">日常</a></div><div class="post_share"><div class="social-share" data-image="https://s3.ax1x.com/2021/02/28/69wnfS.md.jpg" data-sites="facebook,twitter,wechat,weibo,qq"></div><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/social-share.js/dist/css/share.min.css" media="print" onload="this.media='all'"><script src="https://cdn.jsdelivr.net/npm/social-share.js/dist/js/social-share.min.js" defer></script></div></div><div class="post-reward"><div class="reward-button button--animated"><i class="fas fa-qrcode"></i> 打赏</div><div class="reward-main"><ul class="reward-all"><li class="reward-item"><a href="/img/wechat.png" target="_blank"><img class="post-qr-code-img" src= "" data-lazy-src="/img/wechat.png" alt="WeChat"/></a><div class="post-qr-code-desc">WeChat</div></li><li class="reward-item"><a href="/img/alipay.jpg" target="_blank"><img class="post-qr-code-img" src= "" data-lazy-src="/img/alipay.jpg" alt="AliPay"/></a><div class="post-qr-code-desc">AliPay</div></li></ul></div></div><nav class="pagination-post" id="pagination"><div class="prev-post pull-left"><a href="/archives/visual-studio-code-c-config-windows/"><img class="prev-cover" src= "" data-lazy-src="https://s3.ax1x.com/2021/02/28/69DKSO.png" onerror="onerror=null;src='/img/404.jpg'" alt="cover of previous post"><div class="pagination-info"><div class="label">上一篇</div><div class="prev_info">Windows下的Visual Studio Code 配置指南（C/C++）</div></div></a></div><div class="next-post pull-right"><a href="/archives/luogu-solution-p1797/"><img class="next-cover" src= "" data-lazy-src="https://s3.ax1x.com/2021/02/28/69yMlT.md.jpg" onerror="onerror=null;src='/img/404.jpg'" alt="cover of next post"><div class="pagination-info"><div class="label">下一篇</div><div class="next_info">【洛谷】题解 - P1797 【克鲁斯的加减法_NOI导刊2010提高（05）】</div></div></a></div></nav><div class="relatedPosts"><div class="headline"><i class="fas fa-thumbs-up fa-fw"></i><span>相关推荐</span></div><div class="relatedPosts-list"><div><a href="/archives/lanqiao-cup-2021-province-experience/" title="蓝桥杯2021省赛游记 | C/C++ | 大学A组"><img class="cover" src= "" data-lazy-src="https://s2.loli.net/2022/01/08/Z6G8EVBkUctsQfa.jpg" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2021-05-01</div><div class="title">蓝桥杯2021省赛游记 | C/C++ | 大学A组</div></div></a></div></div></div></div><div class="aside-content" id="aside-content"><div class="card-widget card-info"><div class="is-center"><div class="avatar-img"><img src= "" data-lazy-src="https://s2.loli.net/2022/01/08/s8FYlS5uPrtichT.jpg" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"/></div><div class="author-info__name">Von Brank</div><div class="author-info__description">Von Brank, a student from Harbin Institute of Technology, who likes coding, video editing, designing, gaming, and more.</div></div><div class="card-info-data"><div class="card-info-data-item is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">46</div></a></div><div class="card-info-data-item is-center"><a href="/tags/"><div class="headline">标签</div><div class="length-num">25</div></a></div><div class="card-info-data-item is-center"><a href="/categories/"><div class="headline">分类</div><div class="length-num">19</div></a></div></div><a class="button--animated" id="card-info-btn" target="_blank" rel="noopener" href="https://github.com/vonbrank"><i class="fab fa-github"></i><span>Follow Me</span></a><div class="card-info-social-icons is-center"><a class="social-icon" href="https://github.com/vonbrank" target="_blank" title="Github"><i class="fab fa-github"></i></a><a class="social-icon" href="mailto:vonbrank@outlook.com" target="_blank" title="Email"><i class="fas fa-envelope"></i></a><a class="social-icon" href="https://twitter.com/Von_Brank" target="_blank" title="Twitter"><i class="fab fa-twitter"></i></a><a class="social-icon" href="https://steamcommunity.com/id/vonbrank/" target="_blank" title="Steam"><i class="fab fa-steam"></i></a><a class="social-icon" href="/atom.xml" target="_blank" title="RSS"><i class="fas fa-rss"></i></a></div></div><div class="card-widget card-announcement"><div class="item-headline"><i class="fas fa-bullhorn card-announcement-animation"></i><span>公告</span></div><div class="announcement_content">This is my Blog</div></div><div class="sticky_layout"><div class="card-widget" id="card-toc"><div class="item-headline"><i class="fas fa-stream"></i><span>目录</span></div><div class="toc-content"><ol class="toc"><li class="toc-item toc-level-2"><a class="toc-link" href="#NOIP-2018-%E8%AF%95%E9%A2%98%E5%88%97%E8%A1%A8%EF%BC%9A"><span class="toc-text">NOIP 2018 试题列表：</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link"><span class="toc-text">2017.07 - 2017.10</span></a></li><li class="toc-item toc-level-1"><a class="toc-link"><span class="toc-text">2017.11 - 2018.11</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%AD%A3%E5%BC%8FOI%E7%94%9F%E6%B6%AF"><span class="toc-text">正式OI生涯</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#2017-11-04"><span class="toc-text">2017.11.04</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2017-11-05"><span class="toc-text">2017.11.05</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2017-11-08"><span class="toc-text">2017.11.08</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2017-11-22"><span class="toc-text">2017.11.22</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2017-12-24"><span class="toc-text">2017.12.24</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-01-13"><span class="toc-text">2018.01.13</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-02-05"><span class="toc-text">2018.02.05</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-02-25"><span class="toc-text">2018.02.25</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-03-15"><span class="toc-text">2018.03.15</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-03-28"><span class="toc-text">2018.03.28</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-03-30"><span class="toc-text">2018.03.30</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-05-04"><span class="toc-text">2018.05.04</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-05-12"><span class="toc-text">2018.05.12</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-06-23"><span class="toc-text">2018.06.23</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-08-02"><span class="toc-text">2018.08.02</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#2018-10-11"><span class="toc-text">2018.10.11</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%89%B9%E5%88%AB%E6%84%9F%E8%B0%A2Yukko-%E5%B0%BD%E7%AE%A1%E5%A6%82%E4%BB%8A%E4%BB%96%E5%B7%B2%E7%BB%8F%E9%80%80%E5%BD%B9%E4%BA%86"><span class="toc-text">特别感谢Yukko(尽管如今他已经退役了):</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link"><span class="toc-text">Day-1 &amp; Day0</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#2018-11-08-2018-11-09"><span class="toc-text">2018.11.08 - 2018.11.09</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link"><span class="toc-text">Day1</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#2018-11-10"><span class="toc-text">2018.11.10</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#8-30"><span class="toc-text">8:30</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#8-32"><span class="toc-text">8:32</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#8-40"><span class="toc-text">8:40</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#10-35"><span class="toc-text">10:35</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#12-00"><span class="toc-text">12:00</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#15-30"><span class="toc-text">15:30</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link"><span class="toc-text">Day2</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#2018-11-11"><span class="toc-text">2018.11.11</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#8-30-2"><span class="toc-text">8:30</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#8-33"><span class="toc-text">8:33</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#8-35"><span class="toc-text">8:35</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#10-00"><span class="toc-text">10:00</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#10-55"><span class="toc-text">10:55</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#11-50"><span class="toc-text">11:50</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#12-00-2"><span class="toc-text">12:00</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#21-20"><span class="toc-text">21:20</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link"><span class="toc-text">总结</span></a></div></div><div class="card-widget card-recent-post"><div class="item-headline"><i class="fas fa-history"></i><span>最新文章</span></div><div class="aside-list"><div class="aside-list-item"><a class="thumbnail" href="/archives/hit-software-construction-lab1-config/" title="HIT-软件构造 | Lab1 项目配置"><img src= "" data-lazy-src="https://s2.loli.net/2022/05/01/pZiMB5ED7aHY3G4.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="HIT-软件构造 | Lab1 项目配置"/></a><div class="content"><a class="title" href="/archives/hit-software-construction-lab1-config/" title="HIT-软件构造 | Lab1 项目配置">HIT-软件构造 | Lab1 项目配置</a><time datetime="2022-04-29T09:37:16.000Z" title="发表于 2022-04-29 17:37:16">2022-04-29</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/archives/book-note-csapp/" title="【阅读笔记】深入理解计算机系统"><img src= "" data-lazy-src="https://s2.loli.net/2022/01/12/DuW9EMYc274VsvS.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="【阅读笔记】深入理解计算机系统"/></a><div class="content"><a class="title" href="/archives/book-note-csapp/" title="【阅读笔记】深入理解计算机系统">【阅读笔记】深入理解计算机系统</a><time datetime="2022-01-12T06:13:00.000Z" title="发表于 2022-01-12 14:13:00">2022-01-12</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/archives/udemy-note-the-complete-javascript-course/" title="【课程笔记】Udemy - The Complete JavaScript Course 2022: From Zero to Expert!"><img src= "" data-lazy-src="https://s2.loli.net/2022/01/07/IpZeyLJzvVwbO7A.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="【课程笔记】Udemy - The Complete JavaScript Course 2022: From Zero to Expert!"/></a><div class="content"><a class="title" href="/archives/udemy-note-the-complete-javascript-course/" title="【课程笔记】Udemy - The Complete JavaScript Course 2022: From Zero to Expert!">【课程笔记】Udemy - The Complete JavaScript Course 2022: From Zero to Expert!</a><time datetime="2022-01-07T16:13:32.000Z" title="发表于 2022-01-08 00:13:32">2022-01-08</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/archives/udemy-note-advanced-css-and-sass/" title="【课程笔记】Udemy - Advanced CSS and Sass: Flexbox, Grid, Animations and More!"><img src= "" data-lazy-src="https://s2.loli.net/2022/01/07/AKhDvulVjkErmXS.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="【课程笔记】Udemy - Advanced CSS and Sass: Flexbox, Grid, Animations and More!"/></a><div class="content"><a class="title" href="/archives/udemy-note-advanced-css-and-sass/" title="【课程笔记】Udemy - Advanced CSS and Sass: Flexbox, Grid, Animations and More!">【课程笔记】Udemy - Advanced CSS and Sass: Flexbox, Grid, Animations and More!</a><time datetime="2022-01-07T12:44:32.000Z" title="发表于 2022-01-07 20:44:32">2022-01-07</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/archives/udemy-note-build-responsive-real-world-websites-with-html-and-css/" title="【课程笔记】Udemy - Build Responsive Real-World Websites with HTML and CSS"><img src= "" data-lazy-src="https://s2.loli.net/2022/01/07/8O5MjcQI7peF6CK.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="【课程笔记】Udemy - Build Responsive Real-World Websites with HTML and CSS"/></a><div class="content"><a class="title" href="/archives/udemy-note-build-responsive-real-world-websites-with-html-and-css/" title="【课程笔记】Udemy - Build Responsive Real-World Websites with HTML and CSS">【课程笔记】Udemy - Build Responsive Real-World Websites with HTML and CSS</a><time datetime="2022-01-05T14:31:56.000Z" title="发表于 2022-01-05 22:31:56">2022-01-05</time></div></div></div></div></div></div></main><footer id="footer" style="background-image: url('https://s3.ax1x.com/2021/02/28/69wnfS.md.jpg')"><div id="footer-wrap"><div class="copyright">&copy;2021 - 2022 By Von Brank</div><div class="framework-info"><span>框架 </span><a target="_blank" rel="noopener" href="https://hexo.io">Hexo</a><span class="footer-separator">|</span><span>主题 </span><a target="_blank" rel="noopener" href="https://github.com/jerryc127/hexo-theme-butterfly">Butterfly</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="readmode" type="button" title="阅读模式"><i class="fas fa-book-open"></i></button><button id="translateLink" type="button" title="简繁转换">繁</button><button id="darkmode" type="button" title="浅色和深色模式转换"><i class="fas fa-adjust"></i></button><button id="hide-aside-btn" type="button" title="单栏和双栏切换"><i class="fas fa-arrows-alt-h"></i></button></div><div id="rightside-config-show"><button id="rightside_config" type="button" title="设置"><i class="fas fa-cog fa-spin"></i></button><button class="close" id="mobile-toc-button" type="button" title="目录"><i class="fas fa-list-ul"></i></button><button id="go-up" type="button" title="回到顶部"><i class="fas fa-arrow-up"></i></button></div></div><div id="local-search"><div class="search-dialog"><div class="search-dialog__title" id="local-search-title">本地搜索</div><div id="local-input-panel"><div id="local-search-input"><div class="local-search-box"><input class="local-search-box--input" placeholder="搜索文章" type="text"/></div></div></div><hr/><div id="local-search-results"></div><span class="search-close-button"><i class="fas fa-times"></i></span></div><div id="search-mask"></div></div><div><script src="/js/utils.js"></script><script src="/js/main.js"></script><script src="/js/tw_cn.js"></script><script src="https://cdn.jsdelivr.net/npm/instant.page/instantpage.min.js" type="module"></script><script src="https://cdn.jsdelivr.net/npm/vanilla-lazyload/dist/lazyload.iife.min.js"></script><script src="https://cdn.jsdelivr.net/npm/node-snackbar/dist/snackbar.min.js"></script><script src="/js/search/local-search.js"></script><script>var preloader = {
  endLoading: () => {
    document.body.style.overflow = 'auto';
    document.getElementById('loading-box').classList.add("loaded")
  },
  initLoading: () => {
    document.body.style.overflow = '';
    document.getElementById('loading-box').classList.remove("loaded")

  }
}
window.addEventListener('load',preloader.endLoading())</script><div class="js-pjax"><link rel="stylesheet" type="text/css" href="https://cdn.jsdelivr.net/npm/katex@latest/dist/katex.min.css"><script src="https://cdn.jsdelivr.net/npm/katex-copytex@latest/dist/katex-copytex.min.js"></script><link rel="stylesheet" type="text/css" href="https://cdn.jsdelivr.net/npm/katex-copytex@latest/dist/katex-copytex.min.css"><script>(() => {
  document.querySelectorAll('#article-container span.katex-display').forEach(item => {
    btf.wrap(item, 'div', { class: 'katex-wrap'})
  })
})()</script></div><script id="canvas_nest" defer="defer" color="27, 129, 203" opacity="0.7" zIndex="-1" count="256" mobile="false" src="https://cdn.jsdelivr.net/npm/butterfly-extsrc@1/dist/canvas-nest.min.js"></script><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script></div></body></html>